Favard interpolation from subsets of a rectangular lattice
نویسنده
چکیده
This is a study of Favard interpolation—in which the nth derivatives of the interpolant are bounded above by a constant times the nth divided differences of the data—in the case the data is given on some subset of a rectangular lattice in R k. In some instances, depending on the geometry of this subset, we construct a Favard interpolant, and in other instances, we prove that none exists.
منابع مشابه
representation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کاملLagrange Interpolation on a Lattice: Bounding Derivatives by Divided Differences
Fix an integer n > 0. For a multivariate function defined on a (not necessarily rectangular) lattice, an extension is constructed to have, ∀k ≤ n, derivatives of total degree k that are bounded by the function’s tensor product divided differences of total degree k times a constant independent of the lattice and the function. The extension is locally constructed, can have any prescribed smoothne...
متن کاملApproximation by max-product type nonlinear operators
The purpose of this survey is to present some approximation and shape preserving properties of the so-called nonlinear (more exactly sublinear) and positive, max-product operators, constructed by starting from any discrete linear approximation operators, obtained in a series of recent papers jointly written with B. Bede and L. Coroianu. We will present the main results for the max-product opera...
متن کاملInterpolation by polynomial functions of distributive lattices : a generalization of a theorem of R. L. Goodstein
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein’s theorem solves a particular instance of this interpolation problem on a distributive lattice L with least and greatest elements 0 and 1, resp.: Given a function f : {0, 1}n → L, there exists a lattice polynomial function p : Ln → L such that p|{...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Approximation Theory
دوره 163 شماره
صفحات -
تاریخ انتشار 2011